Generalizing DPLL and satisfiability for equalities
نویسندگان
چکیده
منابع مشابه
Generalizing DPLL and satisfiability for equalities
We present GDPLL, a generalization of the DPLL procedure. It solves the satisfiability problem for decidable fragments of quantifier-free firstorder logic. Sufficient properties are identified for proving soundness, termination and completeness of GDPLL. We show how the original DPLL procedure is an instance. Subsequently the GDPLL instances for equality logic, and the logic of equality over in...
متن کاملGeneralizing DPLL to Richer Logics
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other. We show that this approach can be generalized to a richer class of theories. In particular, we present an alternative to lazy SMT solvers, in which DPLL is used only to find propositionally satisfying assignments, who...
متن کاملXOR Satisfiability Solver Module for DPLL Integration
Satisfiability solvers that are based on the Davis-Putnam-Logemann-Loveland (DPLL) algorithm operate on propositional logic formulas in conjunctive normal form (CNF). Despite major improvements in solver technology, using only CNF does not seem to scale well for problem instances involving XOR expressions. We present a decision procedure to determine effectively the satisfiability of XOR clause...
متن کاملSatisfiability Modulo Theory Chains with DPLL(T)
We extend the DPLL(T) framework for satisfiability modulo theories to address richer theories by means of increased flexibility in the interaction between the propositional and theory-specific solvers. We decompose a rich theory into a chain of increasingly more complex subtheories, and define a corresponding propagation strategy which favors the simpler subtheories using two mechanisms. First,...
متن کاملGeneralizing Boolean Satisfiability II: Theory
This is the second of three planned papers describing zap, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high performance solvers. The fundamental idea underlying zap is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal is to def...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2007
ISSN: 0890-5401
DOI: 10.1016/j.ic.2007.03.003